Publication Culture in Computing Research

The dissemination of research results is an integral part of research and hence a crucial component for any scientific discipline. In the area of computing research, there have been raised concerns recently about its publication culture, most notably by highlighting the high priority of conferences (compared to journals in other disciplines) and -- from an economic viewpoint -- the costs of preparing and accessing research results. The Dagstuhl Perspectives Workshop 12452 “Publication Culture in Computing Research” aimed at discussing the main problems with a selected group of researchers and practitioners. The goal was to identify and classify the current problems and to suggest potential remedies. The group of participants was selected in a way such that a wide spectrum of opinions would be presented. This lead to intensive discussions. The workshop is seen as an important step in the ongoing discussion. As a main result, the main problem roots were identified and potential solutions were discussed. The insights will be part of an upcoming manifesto on Publication Culture in Computing Research

Workflows zur Bereitstellung von Zeitschriftenartikeln auf Open-Access-Repositorien - Herausforderungen und Lösungsansätze

Eine zunehmende Anzahl von Zeitschriftenaufsätzen deutscher Wissenschaftseinrichtungen ist im Sinne des Open Access frei verfügbar. Die Open-Access-Verfügbarkeit kann dabei durch Anwendungverschiedener Geschäfts- und Finanzierungsmodelle umgesetzt werden. Wie aber stellen Wissenschaftseinrichtungen sicher, dass auch diejenigen Publikationen, die auf dem Goldenen Weg des Open Access publiziert werden, dauerhaft und in strukturierter Form auf Repositorien bereitgestellt werden? Wie könnte ein dafür idealtypischer Publikationsprozess aussehen? Im Rahmen dieses Artikelswerden zentrale Herausforderungen beschrieben und Lösungsansätze für die Zugänglichmachung von Open-Access-Zeitschriftenartikeln auf Repositorien zusammengestellt.Open access is provided for a growing number of journal articles from German research institutions. Free availability can be achieved in different ways, based on diverse business and financing models. But how can research organisations ensure that their gold open access publications are also made available in a permanent and standardized way in an open access repository? In order to achieve this, what should a model publication process look like? This paper addresses the main challenges and describes possible solutions for making open access articles available in repositories

zChaff: Modifications and Extensions

The application of SAT solver in industrial verification tools is mandatory for the successful analysis of problems derived from hardware design, e.g. Combinational Equivalence Checking (CEC) and Bounded Model Checking (BMC). In [8] Chaff, a new powerful SAT solver, was presented that outperforms most of the existing publicly available SAT solvers when applied to hard real-world problems, e.g. from VLSI CAD. There are two versions available of Chaff: mChaff and zChaff. Both are instances of Chaff, but from the viewpoint of implementation they are totally different since they were developped independently by M. Moskewicz (mChaff) and L. Zhang (zChaff). In this paper we concentrate on zChaff. We analyze the core issues and propose modifications and extensions

Conflict-based Selection of Branching Rules in SAT-Algorithms

The problem of proving that a propositional boolean formula is satisfiable (SAT) is one of the fundamental problems in computer science. The application of SAT solvers in VLSI CAD has become of major interest. The most popular SAT algorithms are based on the well known Davis-Putnam procedure. There, to guide the search, a branching rule is applied for selecting and assigning unassigned variables. Additionally, conflict analysis methods are available that result in non-chronological backtracking that prevents the SAT algorithm from searching nonrelevant parts of the search space. In this paper we focus on the impact of different branching rules and present an approach which (1) allows the use of several branching rules to be applied (not limited to one static rule) and (2) uses information from non-chronological backtracking to dynamically adapt the probabilities of the branching rules to be selected. Our approach results in a faster and more robust behaviour of the SAT algorithm

On Combining 01X-Logic and QBF

We discuss how to combine 01X-logic and quantified boolean formulas (QBF) within a homogeneous SAT/QBF-framework in the context of bounded model checking of blackbox designs. The proposed combination allows a flexible handling of blackboxes w.r.t. computational resources. Preliminary results show the scalability of the approach